ua nt - p h / 06 05 18 5 v 1 2 2 M ay 2 00 6 Optimal Fidelity of Deletion
نویسندگان
چکیده
In the recent years many quantum deleting machines are proposed , with varying fidelity of deletion. In this letter we prove that, the fidelity of deletion obtained in [6] , is optimal. Here we have considered a more general transformation and obtained the fidelity of deletion as a function of dot product between two vectors on the Bloch sphere. We show that the maximal value this function can attain is 3 4 which is equal to the fidelity of deletion proposed in [6]. Quantum mechanics plays a vital role in increasing the efficiency of information processing but on the same time provides a restriction on the set of operation which are feasible in digitized information system. Among this set of operations two most important operations are cloning and deletion. Impossibility of such operations are given by two famous theorems 'no-cloning' theorem [1] and 'no-deletion' theorem [2]. However impossibility of such operations does not eradicate the possibility of constructing approximate cloning and deletion machine. Universal cloning machine and many other cloning machines [3] were constructed and it was also proved that the fidelity 5 6 of the Buzek-Hillary cloning machine (Universal Quantum Cloning machine) is the optimal fidelity with which one can clone an unknown quantum state [4]. Approximate deletion machines were also proposed *
منابع مشابه
ua nt - p h / 01 05 03 7 v 1 9 M ay 2 00 1 Optimal quantum measurements for spin - 1 and spin - 3 2 particles
Positive operator valued measures (POVMs) are presented that allow an unknown pure state of a spin-1 particle to be determined with optimal fidelity when 2 to 5 copies of that state are available. Optimal POVMs are also presented for a spin-3 2 particle when 2 or 3 copies of the unknown state are available. Although these POVMs are optimal they are not always minimal, indicating that there is r...
متن کاملua nt - p h / 06 05 21 9 v 1 2 5 M ay 2 00 6 Classical simulators of quantum computers and no - go theorems
It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen " Free Will " theorems.
متن کاملar X iv : q ua nt - p h / 06 05 23 2 v 1 29 M ay 2 00 6 Propagation of spatially entangled qudits through free space
We show the propagation of entangled states of high-dimensional quantum systems. The qudits states were generated using the transverse correlation of the twin photons produced by spontaneous parametric down-conversion. Their free-space distribution was performed at the laboratory scale and the propagated states maintained a high-fidelity with their original form. The use of entangled qudits all...
متن کاملar X iv : q ua nt - p h / 06 05 10 3 v 1 1 1 M ay 2 00 6 On Concurrence and Entanglement of Rank Two Channels ∗ Armin Uhlmann
Concurrence and further entanglement quantifiers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit channels. There is a simple geometric picture beyond, explaining nicely the role of anti-linearity.
متن کاملar X iv : q ua nt - p h / 06 05 10 3 v 1 1 1 M ay 2 00 6 On Concurrence and Entanglement of Rank Two Channels
Concurrence and further entanglement quantifiers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit channels. There is a simple geometric picture beyond, explaining nicely the role of anti-linearity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006